Ljusternik acceleration and the extrapolated S.O.R. method

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coupled Harmonic Equations , SOR , and Chebyshev Acceleration

A coupled pair of harmonic equations is solved by the application of Chebyshev acceleration to the Jacobi, Gauss-Seidel, and related iterative methods, where the Jacobi iteration matrix has purely imaginary (or zero) eigenvalues. Comparison is made with a block SOR method used to solve the same problem. Introduction. In [4], we proposed a general block SOR method for solving the biharmonic equa...

متن کامل

The Sigma-sor Algorithm and the Optimal Strategy for the Utilization of the Sor Iterative Method

The paper describes, discusses, and numerically illustrates the method for obtaining a priori estimates of the optimum relaxation factor in the SOR iteration method. The computational strategy of this method uses the so-called Sigma-SOR algorithm based on the theoretical result proven in the paper. The method presented is especially efficient for problems with slowly convergent iteration proces...

متن کامل

New Parallel SOR Method by Domain Partitioning

In this paper we propose and analyze a new parallel SOR method, the PSOR method, formulated by using domain partitioning and interprocessor data communication techniques. We prove that the PSOR method has the same asymptotic rate of convergence as the Red/Black (R/B) SOR method for the five-point stencil on both strip and block partitions, and as the four-color (R/B/G/O) SOR method for the nine...

متن کامل

On the Divergent Properties of Two–sided Sor Weierstrass Method

In this paper the convergence properties of the two-side successive over-relaxation (TSSOR) method of Weierstrass’ type is discussed. Initial conditions under which this method is divergent are stated. The main theorem generalizes some recent results concerning divergent properties of simultaneous methods for finding polynomial zeros. Let f(x) = x + an−1xn−1 + · · ·+ a1x+ a0 be a monic polynomi...

متن کامل

Optimum parameter for the SOR-like method for augmented systems

Recently, several proposals for the generalization of Young’s SOR method to the saddle point problem or the augmented system has been presented. One of the most practical versions is the SOR-like method given by Golub et al., [(2001). SOR-like methods for augmented systems. BIT, 41, 71–85.], where the convergence and the determination of its optimum parameters were given. In this article, a ful...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applications of Mathematics

سال: 1977

ISSN: 0862-7940,1572-9109

DOI: 10.21136/am.1977.103683